Fast Kinetic Monte Carlo Simulation of Strained Heteroepitaxy in Three Dimensions
نویسندگان
چکیده
منابع مشابه
Fast Kinetic Monte Carlo Simulation of Strained Heteroepitaxy in Three Dimensions
Accelerated algorithms for simulating the morphological evolution of strained heteroepitaxy based on a ball and spring lattice model in three dimensions are explained. We derive exact Green’s function formalisms for boundary values in the associated lattice elasticity problems. The computational efficiency is further enhanced by using a superparticle surface coarsening approximation. Atomic hop...
متن کاملComputation of strained epitaxial growth in three dimensions by kinetic Monte Carlo
A numerical method for computation of heteroepitaxial growth in the presence of strain is presented. The model used is based on a solid-on-solid model with a cubic lattice. Elastic effects are incorporated using a ball and spring type model. The growing film is evolved using kinetic Monte Carlo (KMC) and it is assumed that the film is in mechanical equilibrium. The force field in the substrate ...
متن کاملKinetic Monte Carlo Simulation of Strained Heteroepitaxial Growth with Intermixing
An efficient method for the simulation of strained heteroepitaxial growth with intermixing using kinetic Monte Carlo is presented. The model used is based on a solid-on-solid bond counting formulation in which elastic effects are incorporated using a ball and spring model. While idealized, this model nevertheless captures many aspects of heteroepitaxial growth, including nucleation, surface dif...
متن کاملSimulation of three-dimensional strained heteroepitaxial growth using kinetic Monte Carlo
Efficient algorithms for the simulation of strained heteroepitxial growth with intermixing in 2+1 dimensions are presented. The first of these algorithms is an extension of the energy localization method [T.P. Schulze and P. Smereka, An Energy Localization Principle and its Application to Fast Kinetic Monte Carlo Simulation of Heteroepitaxial Growth, J. Mech. Phys. Sol. 3 521-538 (2009)] from 1...
متن کاملEfficient kinetic Monte Carlo simulation
This paper concerns Kinetic Monte Carlo (KMC) algorithms that have a singleevent execution time independent of the system size. Two methods are presented— one that combines the use of inverted-list data structures with rejection Monte Carlo and a second that combines inverted lists with the Marsaglia-Norman-Cannon algorithm. The resulting algorithms apply to models with rates that are determine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2008
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-008-9205-9